Search results for "Hungarian algorithm"
showing 2 items of 2 documents
Dynamic programming and Munkres algorithm for optimal photovoltaic arrays reconfiguration
2015
Abstract In this paper, an original formulation of the control problem for optimal PV array reconfiguration, following a Total Cross Tied layout, is proposed. The formulation follows the well-known subset sum problem, which is a special case of the knapsack problem. The reconfiguration is a measure devoted to mitigate the mismatch effect and maximize the output power of small photovoltaic plants under non-homogeneous working conditions. Therefore, reconfiguration means changing the connections of the solar panels adaptively by a dynamic switching matrix. The control system implements an easy dynamic programming algorithm to change the switches layout. The use of the Munkres assignment metho…
Three-dimensional phase unwrapping using the Hungarian algorithm.
2009
We propose a three-dimensional phase unwrapping technique that uses the Hungarian algorithm to join together all the partial residual loops that may occur in a wrapped phase volume. Experimental results have shown that the proposed algorithm is more robust and reliable than other well-known three-dimensional phase unwrapping algorithms. Additionally, the proposed algorithm is fast in terms of computational complexity, which makes it suitable for practical applications.